Acceleration Techniques for Approximating the Matrix Exponential Operator

In this paper we investigate some well established and more recent methods that aim at approximating the vector exp(A)v when A is a large symmetric negative semidefinite matrix, by efficiently combining subspace projections and spectral transformations. We show that some recently developed acceleration procedures may be restated as preconditioning techniques for the partial fraction expansion form of an approximating rational function. These new results allow us to devise a-priori strategies to select the associated acceleration parameters; theoretical and numerical results are shown to justify these choices. Moreover, we provide a performance evaluation among several numerical approaches to approximate the action of the exponential of large matrices. Our numerical experiments provide a new, in some cases unexpected picture of the actual behavior of the discussed methods.